منابع مشابه
On the Finitary Bisimulation
The finitely observable, or finitary, part of bisimulation is a key tool in establishing full abstraction results for denotational semantics for process algebras with respect to bisimulation-based preorders. A bisimulation-like characterization of this relation for arbitrary transition systems is given, relying on Abramsky’s characterization in terms of the finitary domain logic. More informati...
متن کاملFinitary Reducibility on Equivalence Relations
We introduce the notion of finitary computable reducibility on equivalence relations on the domain ω. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be Π n+2-complete under computable reducibility, we show that, for every n, there does exist a natural equivalence relation which...
متن کاملFinitary Languages
The class of ω-regular languages provides a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually”. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness [AH98]. It requires that there exists an unknown, fixed bound b...
متن کاملFinitary Coloring
Suppose that the vertices of Z are assigned random colors via a finitary factor of independent identically distributed (iid) vertex-labels. That is, the color of vertex v is determined by a rule that examines the labels within a finite (but random and perhaps unbounded) distance R of v, and the same rule applies at all vertices. We investigate the tail behavior of R if the coloring is required ...
متن کاملFinitary Sketches
Finitary sketches, i.e., sketches with nite-limit and nite-colimit specii-cations, are proved to be as strong as geometric sketches, i.e., sketches with nite-limit and arbitrary colimit speciications. Categories sketchable by such sketches are fully characterized in the innnitary rst-order logic: they are axiomatizable by-coherent theories, i.e., basic theories using nite conjunctions, countabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 1997
ISSN: 0025-5645
DOI: 10.2969/jmsj/04930487